Computation sequences: a way to characterize classes of attribute grammarsNIELSON, H. R.Acta informatica. 1983, Vol 19, Num 3, pp 255-268, issn 0001-5903Article

A low and a high hierarchy within NPSCHONING, U.Journal of computer and system sciences (Print). 1983, Vol 27, Num 1, pp 14-28, issn 0022-0000Article

A note on programmed OL systemsDASSOW, J.Information sciences. 1983, Vol 30, Num 1, pp 1-4, issn 0020-0255Article

On the subword complexity of m-free DOL languagesEHRENFEUCHT, A; ROZENBERG, G.Information processing letters. 1983, Vol 17, Num 3, pp 121-124, issn 0020-0190Article

Semi-linearity, Parikh-boundeness and tree adjunct languagesYOKOMORI, T; JOSHI, A. K.Information processing letters. 1983, Vol 17, Num 3, pp 137-143, issn 0020-0190Article

The semantic and syntactic manipulation of vacancies in associative binary treesABDOLLAHZADEH, F; COOK, D. J; EVANS, D. J et al.International journal of computer mathematics. 1983, Vol 13, Num 3-4, pp 189-208, issn 0020-7160Article

Recherche linéaire d'un carré dans un mot = Linear search of a square in a wordCROCHEMORE, M.Comptes rendus des séances de l'Académie des sciences. Série 1, Mathématique. 1983, Vol 296, Num 18, pp 781-784, issn 0249-6291Article

On Gödel speed-up and succinctness of language representationsHARTMANIS, J.Theoretical computer science. 1983, Vol 26, Num 3, pp 335-342, issn 0304-3975Article

Subset languages of Petri nets. I: The relationship to string languages and normal formsROZENBERG, G; VERRAEDT, R.Theoretical computer science. 1983, Vol 26, Num 3, pp 301-326, issn 0304-3975Article

DLT 2004 : developements in language theory (Auckland, 13-17 December 2004)Calude, Cristian S; Dinneen, Michael J; Claude, Elena et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24014-4, XI, 429 p, isbn 3-540-24014-4Conference Proceedings

Basic notions of reaction systemsEHRENFEUCHT, A; ROZENBERG, G.Lecture notes in computer science. 2004, pp 27-29, issn 0302-9743, isbn 3-540-24014-4, 3 p.Conference Paper

On the complexity of LL(k) testingSIPPU, S; SOISALON-SOININEN, E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 244-268, issn 0022-0000Article

Intégrité des algèbres de séries formelles sur un alphabet partiellement commutatifTHIBON, J.-Y.Theoretical computer science. 1985, Vol 41, Num 1, pp 109-112, issn 0304-3975Article

About Duval's conjectureHARIU, T; NOWOTKA, D.Lecture notes in computer science. 2003, pp 316-324, issn 0302-9743, isbn 3-540-40434-1, 9 p.Conference Paper

Some new directions and questions in parameterized complexityDOWNEY, Rodney G; MCCARTIN, Catherine.Lecture notes in computer science. 2004, pp 12-26, issn 0302-9743, isbn 3-540-24014-4, 15 p.Conference Paper

Structural operational semantics for weak bisimulationsBLOOM, B.Theoretical computer science. 1995, Vol 146, Num 1-2, pp 25-68, issn 0304-3975Article

Algebras of iteration theoriesESIK, Z.Journal of computer and system sciences (Print). 1983, Vol 27, Num 2, pp 291-303, issn 0022-0000Article

On the equality of grammatical familiesGINSBURG, S; GOLDSTINE, J; SPANIER, E. H et al.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 171-196, issn 0022-0000Article

The structure of type A semigroupsARMSTRONG, S.Semigroup forum. 1984, Vol 29, Num 3, pp 319-336, issn 0037-1912Article

Land and early semantics coincide for testingINGOLFSDOTTIR, A.Theoretical computer science. 1995, Vol 146, Num 1-2, pp 341-349, issn 0304-3975Article

On subdirectly irreducible lattice-ordered semigroupsREPNITZKII, V. B.Semigroup forum. 1984, Vol 29, Num 3, pp 277-318, issn 0037-1912Article

Graph-grammars and their application to computer science. 2nd International workshop, Haus Ohrbeck, Germany, October 4-8, 1982EHRIG, H; NAGL, M; ROZENBERG, G et al.Lecture notes in computer science. 1983, Num 153, issn 0302-9743, VII-452 pConference Proceedings

Words avoiding 7/3-powers and the thue-morse morphismRAMPERSAD, Narad.Lecture notes in computer science. 2004, pp 357-367, issn 0302-9743, isbn 3-540-24014-4, 11 p.Conference Paper

On the power of built-in relations in certain classes of program schemesCHAUHAN, S. R; STEWART, I. A.Information processing letters. 1999, Vol 69, Num 2, pp 77-82, issn 0020-0190Article

One-unambiguous regular languagesBRÜGGEMANN-KLEIN, A; WOOD, D.Information and computation (Print). 1998, Vol 142, Num 2, pp 182-206, issn 0890-5401Article